Introducing Equational Semantics for Argumentation Networks
نویسنده
چکیده
This paper provides equational semantics for Dung’s argumentation networks. The network nodes get numerical values in [0,1], and are supposed to satisfy certain equations. The solutions to these equations correspond to the “extensions” of the network. This approach is very general and includes the Caminada labelling as a special case, as well as many other so-called network extensions, support systems, higher level attacks, Boolean networks, dependence on time, etc, etc. The equational approach has its conceptual roots in the 19th century following the algebraic equational approach to logic by George Boole, Louis Couturat and Ernst Schroeder.
منابع مشابه
Introducing EqArgSolver: An argumentation solver using equational semantics
In this paper we introduce EqArgSolver, an argumentation solver using equational semantics. EqArgSolver is based on the prototype GRIS submitted to the first International Competition on Computational Models of Argumentation, but provides two major advancements over GRIS. Firstly, it uses the much more e cient discrete version of the Gabbay-Rodrigues Iteration Schema [7], and secondly, it requi...
متن کاملProbabilistic Argumentation. An Equational Approach
There is a generic way to add any new feature to a system. It involves 1) identifying the basic units which build up the system and 2) introducing the new feature to each of these basic units. In the case where the system is argumentation and the feature is probabilistic we have the following. The basic units are: a. the nature of the arguments involved; b. the membership relation in the set S ...
متن کاملThe Equational Approach to CF2 Semantics
We introduce a family of new equational semantics for argumentation networks which can handle odd and even loops in a uniform manner. We offer one version of equational semantics which is equivalent to CF2 semantics, and a better version which gives the same results as traditional Dung semantics for even loops but can still handle odd loops. 1 Background and orientation Our starting point is th...
متن کاملSocial Abstract Argumentation
In this paper we take a step towards using Argumentation in Social Networks and introduce Social Abstract Argumentation Frameworks, an extension of Dung’s Abstract Argumentation Frameworks that incorporates social voting. We propose a class of semantics for these new Social Abstract Argumentation Frameworks and prove some important non-trivial properties which are crucial for their applicabilit...
متن کاملDeening Normative Systems for Qualitative Argumentation
Inspired by two diierent approaches to providing a qualitative method for reasoning under uncertainty|qualitative probabilistic networks and systems of argumentation|this paper attempts to combine the advantages of both by deening systems of argumentation that have a probabilistic semantics.
متن کامل